Testability of Oracle Automata
نویسندگان
چکیده
In this paper, we introduce oracle (finite) automata that are finite/Buchi automata augmented with oracles in some classes of formal languages. We present some testability results for the emptiness problem of oracle automata associated with various classes of oracles. Moreover, we show that some important verification problems (such as reachability, safety, LTL model-checking, etc.) for oracle automata can be reduced to testing the emptiness of oracle automata. Our theory results on the testability of oracle automata can find applications in the verification of a system containing unspecified/partially specified components.
منابع مشابه
Designing of Testable Reversible QCA Circuits Using a New Reversible MUX 2×1
Recently testing of Quantum-dot Cellular Automata (QCA) Circuits has attracted a lot of attention. In this paper, QCA is investigated for testable implementations of reversible logic. To amplify testability in Reversible QCA circuits, a test method regarding to Built In Self Test technique is developed for detecting all simulated defects. A new Reversible QCA MUX 2×1 desig...
متن کاملOn Local Testability in Watson-Crick Finite Automata
Watson-Crick finite automata were first proposed in [2] inspired by formal language theory, finite states machines and some ingredients from DNA computing such as working with molecules as double stranded complementary strings. Here, we define different kinds of local testability in this model. Mainly, we will explore local testability in the upper (lower) strand and in the double strand.
متن کاملDesigning of Testable Reversible QCA Circuits Using a New Reversible MUX 2×1
Recently testing of Quantum-dot Cellular Automata (QCA) Circuits has attracted a lot of attention. In this paper, QCA is investigated for testable implementations of reversible logic. To amplify testability in Reversible QCA circuits, a test method regarding to Built In Self Test technique is developed for detecting all simulated defects. A new Reversible QCA MUX 2×1 desig...
متن کاملInference of k-Testable Directed Acyclic Graph Languages
In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-te...
متن کاملDesigning for Software Testability Using Automated Oracles
Software testing often requires massive numbers of test cases that must be manually inspected for correctness. This paper demonstrates the use of software \test oracles" to automate the process of checking the correctness of program output. The Prosper system, implemented by the authors, can be used to de ne test oracles and monitor the runtime behavior of software. An e ective method to design...
متن کامل